منابع مشابه
Transitivity conditions in infinite graphs
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all k ≥ 3, the k-CS-transitive such graphs.
متن کاملDegree conditions for forests in graphs
IfH is any forest of order nwithm edges, then any graphG of order nwith d(u)+d(v) 2m−1 for any two non-adjacent vertices u, v contains H.
متن کاملMinimality Conditions on Πk-Connectedness in Graphs
Let k be a positive integer. A graph G = (V,E) is said to be Πk connected if for any given edge subset F of E(G) with |F | = k, the subgraph induced by F is connected. In this paper, we explore the minimality conditions on Πkconnectedness of a graph and also its properties of prism and corona graphs are obtained.
متن کاملDensity Conditions For Triangles In Multipartite Graphs
We consider the problem of finding a large or dense triangle-free subgraph in a given graph G. In response to a question of P. Erdős, we prove that, if the minimum degree of G is at least 17|V (G)|/20, the largest triangle-free subgraphs are precisely the largest bipartite subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite trip...
متن کاملDistance-balanced graphs: Symmetry conditions
A graph X is said to be distance–balanced if for any edge uv of X , the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. A graph X is said to be strongly distance–balanced if for any edge uv of X and any integer k, the number of vertices at distance k from u and at distance k+1 from v is equal to the number of vertices at distance k + 1 from u a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1978
ISSN: 0095-8956
DOI: 10.1016/0095-8956(78)90048-5